Hereditary completeness and quasi-reflexivity
نویسندگان
چکیده
منابع مشابه
Completeness and quasi-completeness
The appropriate general completeness notion for topological vector spaces is quasi-completeness. There is a stronger general notion of completeness, which proves to be too strong in general. For example, the appendix shows that weak-star duals of infinite-dimensional Hilbert spaces are quasi-complete, but never complete in the stronger sense. Quasi-completeness for Fréchet spaces is ordinary me...
متن کاملRelationships between completeness of fuzzy quasi-uniform spaces
In this paper, we give a kind of Cauchy 1-completeness in probabilistic quasi-uniform spaces by using 1-filters. Utilizingthe relationships among probabilistic quasi-uniformities, classical quasi-uniformities and Hutton [0, 1]-quasi-uniformities,we show the relationships between their completeness. In fuzzy quasi-metric spaces, we establish the relationshipsbetween the completeness of induced p...
متن کاملSymmetric Quasi-hereditary Envelopes
Abstract. We show how any finite-dimensional algebra can be realized as an idempotent subquotient of some symmetric quasihereditary algebra. In the special case of rigid symmetric algebras we show that they can be realized as centralizer subalgebras of symmetric quasi-hereditary algebras. We also show that the infinite-dimensional symmetric quasi-hereditary algebras we construct admit quasi-her...
متن کاملCompleteness of Quasi-uniform and Syntopological Spaces
In this paper we begin to develop the filter approach to (completeness of) quasiuniform spaces, proposed in [8, Section V]. It will be seen that this permits a more powerful and elegant account of completion to be given than was feasible using sequences or nets [8]. Just as in the previous version [8], we find that received notions concerning convergence need to be revised and reformulated to d...
متن کاملQuasi-completeness and functions without fixed-points
Q-reducibility is a natural generalization of many-one reducibility (m-reducibility): if A ≤m B via a computable function f(x), then A ≤Q B via the computable function g(x) such that Wg(x) = {f(x)}. Also this reducibility is connected with enumeration reducibility (e-reducibility) as follows: if A ≤Q B via a computable function g(x), then ω −A ≤e ω −B via the c. e. set W = {〈x, 2y〉 | x ∈ ω, y ∈...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0352944-1